Queen problems are unstructured problems, whose solution scheme can be applied in the actual\njob scheduling. As for the n-queen problem, backtracking algorithm is considered as an effective\napproach when the value of n is small. However, in case the value of n is large, the phenomenon of\ncombination explosion is expected to occur. In order to solve the aforementioned problem, queen\nproblems are firstly converted into the problem of function optimization with constraints, and\nthen the corresponding mathematical model is established. Afterwards, the n-queen problem is\nsolved by constructing the genetic operators and adaption functions using the integer coding\nbased on the population search technology of the evolutionary computation. The experimental\nresults demonstrate that the proposed algorithm is endowed with rapid calculation speed and\nhigh efficiency, and the model presents simple structure and is readily implemented.
Loading....